Mesenchymal and stemness circulating tumor cells in early breast cancer diagnosis

<p>Abstract</p> <p>Background</p> <p>Epithelial mesenchymal transition (EMT) is a crucial event likely involved in dissemination of epithelial cancer cells. This process enables them to acquire migratory/invasive properties, contributing to tumor and metastatic spread. To know if this event is an early one in breast cancer, we developed a clinical trial. The aim of this protocol was to detect circulating tumor cells endowed with mesenchymal and/or stemness characteristics, at the time of initial diagnosis. Breast cancer patients (n = 61), without visceral or bone metastasis were enrolled and analysis of these dedifferentiated circulating tumor cells (ddCTC) was realized.</p> <p>Methods</p> <p><it>AdnaGen </it>method was used for enrichment cell selection. Then, ddCTC were characterized by RT-PCR study of the following genes: PI3Kα, Akt-2, Twist1 (EMT markers) and ALDH1, Bmi1 and CD44 (stemness indicators).</p> <p>Results</p> <p>Among the studied primary breast cancer cohort, presence of ddCTC was detected in 39% of cases. This positivity is independant from tumor clinicopathological factors apart from the lymph node status.</p> <p>Conclusions</p> <p>Our data uniquely demonstrated that <it>in vivo </it>EMT occurs in the primary tumors and is associated with an enhanced ability of tumor cells to intravasate in the early phase of cancer disease. These results suggest that analysis of circulating tumor cells focused on cells showing mesenchymal or stemness characteristics might facilitate assessment of new drugs in clinical trials.</p

Counting method for multi-party computation over non-abelian groups

In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is f G (x 1,...,x n ) :∈=∈x 1 •...•x n where each participant P i holds an input x i from the non-commutative group G. The settings of their study are the passive adversary model, information-theoretic security and black-box group operations over G. They presented three results. The first one is that honest majority is needed to ensure security when computing f G . Second, when the number of adversary , they reduced building such a secure protocol to a graph coloring problem and they showed that there exists a deterministic secure protocol computing f G using exponential communication complexity. Finally, Desmedt et al. turned to analyze random coloring of a graph to show the existence of a probabilistic protocol with polynomial complexity when t∈<∈n/μ, in which μ is a constant less than 2.948. We call their analysis method of random coloring the counting method as it is based on the counting of the number of a specific type of random walks. This method is inspiring because, as far as we know, it is the first instance in which the theory of self-avoiding walk appears in multiparty computation. In this paper, we first give an altered exposition of their proof. This modification will allow us to adapt this method to a different lattice and reduce the communication complexity by 1/3, which is an important saving for practical implementations of the protocols. We also show the limitation of the counting method by presenting a lower bound for this technique. In particular, we will deduce that this approach would not achieve the optimal collusion resistance. © 2008 Springer Berlin Heidelberg

Privacy-preserving distributed set intersection

7 page(s

analysis of bilinear pairing-based accumulator for identity escrowing

改革开放以来,基层工会工作进入了一个全新的历史时期,作为工会工作重要组成部分的基层工会宣传教育工作同样也面临着新的形势和新的考验。在这样的形势下,基层工会宣传教育工作的理论原则、方针、方法,如何体现与时俱进,真正做到实事求是、指导实践、服务实践,更好地适应工会工作发展的需要

Rateless codes for the multicast stream authentication problem

We study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a protocol which allows any packet to be authenticated at the receiver with probability arbitrary close to 1. We also compare LT codes to other families of rateless codes which could be used in that context in order to minimize the packet overhead as well as the time complexity of encoding and decoding data.16 page(s